Making Local Algorithms Wait-Free: the Case of Ring Coloring
نویسندگان
چکیده
منابع مشابه
Wait-Free Handshaking using Rainbow Coloring
The construction of shared data objects is a fundamental issue in asynchronous concurrent systems, since these objects provide the means for communication and synchronization between processes. Constructions which guarantee that concurrent access to the shared object by processes is free from waiting are of particular interest, since they help to increase the amount of parallelism and to provid...
متن کاملWait-Free Algorithms for Heaps
This paper examines algorithms to implement heaps on shared memory multiprocessors. A natural model for these machines is an asynchronous parallel machine, in which the processors are subject to arbitrary delays. On such machines, it is desirable for algorithms to be wait-free, meaning that each thread makes progress independent of the other threads executing on the machine. We present a waitfr...
متن کاملHow a Rainbow Coloring Function Can Simulate Wait-Free Handshaking
How to construct shared data objects is a fundamental issue in asynchronous concurrent systems, since these objects provide the means for communication and synchronization between processes in these systems. Constructions which guarantee that concurrent access to the shared object by processes is free from waiting are of particular interest, since they may help to increase the amount of paralle...
متن کاملAre lock-free concurrent algorithms practically wait-free? Citation
Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While ...
متن کاملObstruction-Free Algorithms Can Be Practically Wait-Free
The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations that are faster in the uncontended case. Pragmatic contention management techniques appear to be effective at facilitating progress in practice, but, as far as we know, none guarantees progress. We present a transformation that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2017
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-017-9772-y